#include <bits/stdc++.h>
using namespace std;
int n,maxx=0;
int num[100005];
bool vis[100005];


signed main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    int len=n;
    for(int i=1;i<=n;i++)
        scanf("%d",&num[i]);
    sort(num+1,num+n+1);
    for(int i=2;i<=n;i++)
        for(int j=1;j<=i-1;j++)
        {
            if(num[i]>num[j]&&!vis[j])
            {
                len--;
                vis[j]=true;
                break;
            }
        }
    printf("%d",len);
    return 0;
}
